- complete predicate
- логикаполный предикат
English-Russian scientific dictionary. 2008.
complete predicate
Смотреть что такое "complete predicate" в других словарях:
Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… … Wikipedia
Predicate (grammar) — In traditional grammar, a predicate is one of the two main parts of a sentence (the other being the subject, which the predicate modifies). In current linguistic semantics, a predicate is an expression that can be true of something. Thus, the… … Wikipedia
Complete theory — In mathematical logic, a theory is complete if it is a maximal consistent set of sentences, i.e., if it is consistent, and none of its proper extensions is consistent. For theories in logics which contain classical propositional logic, this is… … Wikipedia
predicate calculus — Logic. See functional calculus. Also called predicate logic. [1945 50] * * * Part of modern symbolic logic which systematically exhibits the logical relations between propositions involving quantifiers such as all and some. The predicate calculus … Universalium
complete — com•plete [[t]kəmˈplit[/t]] adj. v. plet•ed, plet•ing 1) having all parts or elements; lacking nothing; whole; entire; full: a complete set of golf clubs[/ex] 2) finished; ended; concluded: a complete orbit[/ex] 3) having all the required or… … From formal English to slang
complete — I. adjective (completer; est) Etymology: Middle English complet, from Latin completus, from past participle of complēre Date: 14th century 1. a. having all necessary parts, elements, or steps < a complete diet > b. having all four sets of floral… … New Collegiate Dictionary
Kleene's T predicate — In computability theory, the T predicate, first studied by mathematician Stephen Cole Kleene, is a particular set of triples of natural numbers that is used to represent computable functions within formal theories of arithmetic. Informally, the T … Wikipedia
HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… … Encyclopedia of Judaism
Combinatory logic — Not to be confused with combinational logic, a topic in digital electronics. Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been… … Wikipedia
formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction the abstract study of propositions, statements, or assertively used … Universalium
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
